#include <bits/stdc++.h>
using namespace std;
int n, m, v, p, q;
int main(){
cin >> n >> m >> v;
if (v == 1) p = 2;
else p = 1;
if (m < n - 1 || m > n - 1 + (n - 2) * (n - 3) / 2) {
cout << -1;return 0;
}
for (int i = 1; i <= n; i++){
if (i == v) continue;
cout << v << ' ' << i << endl;
}
m -= (n - 1);
for (int i = 1; i <= n; i++){
if (i == v || i == p) continue;
for (int j = i + 1; j <= n; j++){
if (j == v || j == p) continue;
if (m == 0) return 0;
cout << i << ' ' << j << endl;
m--;
}
}
return 0;
}
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |